Successive Cancellation Decoding of Single Parity-Check Product Codes: Analysis and Improved Decoding

A product code with single parity-check component codes can be described via the tools of a multi-kernel polar code, where rows generator matrix are chosen according to constraints imposed by construction. Following this observation, successive cancellation decoding such is introduced. In particular, error probability over binary memoryless symmetric channels under characterized. bridge analysis introduced Elias also established for erasure channel. Successive list then described. For provided example, simulations input additive white Gaussian channel show that outperforms belief propagation applied graph. Finally, performance concatenation high-rate outer investigated distance spectrum analysis. Examples concatenations performing within 0.7 dB from random coding union bound provided.